Queue Length Based Fair Queueing in Core-Stateless Networks
نویسندگان
چکیده
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is comparable to that of CSFQ, and it performs much better than RFQ.
منابع مشابه
Queue Length Based Fair Queueing in Core - Stateless Networks 1
In this paper, we present Queue Length based Fair Queueing (QLFQ), a scheme to approximate fair bandwidth allocation without per-flow state. We have evaluated QLFQ together with CSFQ and RFQ with several different configurations and traffic sources. The simulation results show that QLFQ is able to achieve approximately fair bandwidth sharing in all of these scenarios. The performance of QLFQ is...
متن کاملAdaptive CSFQ: A New Fair Queuing Mechanism for SCORE Networks
In stateless core (SCORE) networks, edge routers maintain per-flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کاملA control-theoretical approach for achieving fair bandwidth allocations in core-stateless networks
In this paper, we propose the use of a control theoretical approach in the design of fair queueing algorithms based on the Scalable Core (SCORE) / Dynamic Packet State (DPS) architecture. In particular, we make use of the Linear Quadratic control method from optimal control theory to design stable and robust systems that are simple to implement. Simulation results show that this approach gives ...
متن کاملAdaptive CSFQ: determining the packet dropping probability adaptively for achieving fair bandwidth allocations in SCORE networks
In stateless core (SCORE) networks, edge routers maintain per flow state while core routers do not. Core stateless fair queuing (CSFQ) has been proposed for approximating the operation of per-flow queuing techniques in SCORE networks. However, the packet dropping probability offered by CSFQ suits only UDP flows. Thus, CSFQ cannot achieve fair bandwidth allocation for TCP flows. This paper propo...
متن کاملAdaptive Filtering Queueing for Improving Fairness
In this paper, we propose a scalable and efficient Active Queue Management (AQM) scheme to provide fair bandwidth sharing when traffic is congested dubbed Adaptive Filtering Queueing (AFQ). First, AFQ identifies the filtering level of an arriving packet by comparing it with a flow label selected at random from the first level to an estimated level in the filtering level table. Based on the acce...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001